Termination of graph rewriting is undecidable Detlef
نویسنده
چکیده
It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turing machines or of the termination problem for string rewriting systems to the present problem.
منابع مشابه
Termination of Graph Rewriting is Undecidable
It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turing machines or of the termination problem for string rewriting systems to the present problem.
متن کاملConfluence of Graph Transformation Revisited
It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply...
متن کاملTerm Graph Rewriting
Term graph rewriting is concerned with the representation of functional expressions as graphs, and the evaluation of these expressions by rule-based graph transformation. Representing expressions as graphs allows to share common subexpressions, improving the eeciency of term rewriting in space and time. Besides eeciency, term graph rewriting diiers from term rewriting in properties like termina...
متن کاملNon-simplifying Graph Rewriting Termination
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky’s work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs and of using graph rewriting rules to compute on those stru...
متن کاملEssentials of Term Graph Rewriting
Term graph rewriting is a model for computing with graphs representing functional expressions. Graphs allow to share common subexpressions which improves the eÆciency of conventional term rewriting in space and time. This article reviews essentials of term graph rewriting concerning soundness, completeness, termination and con uence.
متن کامل